- B-tree indexing
- индексация БД с помощью В-деревьевсм. тж. B-tree
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
B-tree indexing
Смотреть что такое "B-tree indexing" в других словарях:
Term indexing — In computer science, term indexing is the task of creating an index of terms and clauses in a collection.Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall intothe… … Wikipedia
Hashed array tree — In computer science, a hashed array tree (HAT) is a dynamic array algorithm invented by Edward Sitarski in 1996. Citation | title=HATs: Hashed array trees | contribution=Algorithm Alley | journal=Dr. Dobb s Journal | date=September 1996 |… … Wikipedia
Common Indexing Protocol — The Common Indexing Protocol (CIP) was an attempt in the IETF working group FIND during the mid 1990s to define a protocol for exchanging index information between directory services. In the X.500 Directory model, searches scoped near the root of … Wikipedia
Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… … Wikipedia
Suffix tree — In computer science, a suffix tree (also called suffix trie, PAT tree or, in an earlier form, position tree) is a data structure that presents the suffixes of a given string in a way that allows for a particularly fast implementation of many… … Wikipedia
B+ tree — In computer science, a B+ tree is a type of tree which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key . It is a dynamic, multilevel index, with maximum… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
R* tree — is a variant of R tree for indexing spatial information. R* tree supports point and spatial data at the same time with a slightly higher cost than other R trees.It was proposed by Norbert Beckmann, Hans Peter Kriegel, Ralf Schneider, Bernhard… … Wikipedia
H tree — Not to be confused with Htree, a Linux filesystem indexing structure. The first ten levels of an H tree The H tree (so called because its first two steps resemble the letter H ) is a family of fractal sets whose Hausdorff dimension is equal to 2 … Wikipedia
R+ tree — is a tree data structure, a variant of the R tree, used for indexing spatial information.Difference between R+ trees and R treesR+ trees are a compromise between R trees and K D B trees; they avoid overlapping of internal nodes by inserting an… … Wikipedia
Directory information tree — A directory information tree (DIT) is data represented in a hierarchical tree like structure consisting of the Distinguished Names (DNs) of directory service entries. Both the X.500 protocols and the Lightweight Directory Access Protocol (LDAP)… … Wikipedia
